Change point detection in social networks—Critical review with experiments
نویسندگان
چکیده
منابع مشابه
A review of change point detection methods
In this work, methods to detect one or several change points in multivariate time series are reviewed. They include retrospective (o -line) procedure such as maximum likelihood estimation, regression, kernel methods, etc. In this large area of research, applications are numerous and diverse; many di erent models and operational constraints (on precision, complexity,...) exist. A formal framewor...
متن کاملFast Change Point Detection on Dynamic Social Networks
A number of real world problems in many domains (e.g. sociology, biology, political science and communication networks) can be modeled as dynamic networks with nodes representing entities of interest and edges representing interactions among the entities at different points in time. A common representation for such models is the snapshot model where a network is defined at logical time-stamps. ...
متن کاملChange point detection
Abstract: We propose new tests to detect a change in the mean of a time series. Like many existing tests, the new ones are based on the CUSUM process. Existing CUSUM tests require an estimator of a scale parameter to make them asymptotically distribution free under the no change null hypothesis. Even if the observations are independent, the estimation of the scale parameter is not simple since ...
متن کاملChange Point Detection
In the present paper, we develop a new efficient approach to detection of abrupt changes in a sequence of recognized digital images, which can be applied to a wide variety of practical problems of digital image processing. The principal idea of this approach consists in transforming an original sample of the observed data to a set of onedimensional statistics and measuring a distance from homog...
متن کاملKernel change-point detection
We tackle the change-point problem with data belonging to a general set. We propose a penalty for choosing the number of change-points in the kernel algorithm of Harchaoui and Cappé (2007). This penalty generalizes the one proposed for one dimensional signals by Lebarbier (2005). We prove it satisfies a non-asymptotic oracle inequality by showing new concentration results in Hilbert spaces. Exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science Review
سال: 2018
ISSN: 1574-0137
DOI: 10.1016/j.cosrev.2018.05.001